Isometric approximation property of unbounded sets
نویسندگان
چکیده
منابع مشابه
On Unbounded Tolerable Solution Sets
We prove that the nonempty tolerable solution set of the interval linear system Ax = b is unbounded if and only if the interval matrix of the system has linearly dependent degenerate columns. Also, we prove that the tolerable solution set may be represented as a sum of the linear subspace {c R | Ac = 0} and a bounded convex polyhedron and propose a way for suitable estimation of unbounded tol...
متن کاملDiscrete Approximation of Unbounded Operators and Approximation of their Spectra
Let E be a Banach space over C and let the densely defined closed linear operator A: D(A) ... EQ E be discretely approximated by the sequence ((An, D(An)))n ¥N of operators An where each An is densely defined in the Banach space Fn. Let sa(A) be the approximate point spectrum of A and let se(An) denote the e-pseudospectrum of An. Generalizing our own result, we show that sa(A) ... lim inf se(An...
متن کاملThe Strong Approximation Property and the Weak Bounded Approximation Property
We show that the strong approximation property (strong AP) (respectively, strong CAP) and the weak bounded approximation property (respectively, weak BCAP) are equivalent for every Banach space. This gives a negative answer to Oja’s conjecture. As a consequence, we show that each of the spaces c0 and `1 has a subspace which has the AP but fails to have the strong AP.
متن کاملFinite Illumination of Unbounded Closed Convex Sets
If K is an unbounded closed convex subset of Ed having nonempty interior, we seek necessary and/or sufficient conditions to ensure that the boundary of K can be externally illuminated from a finite set of directions. This problem was stated as open in a recent book by Boltyanski. The tools used in this search are those developed by Visibility Theory such as the ideas of star, inner stem, visibi...
متن کاملMulti-objective Optimization with Unbounded Solution Sets
Machine learning often requires the optimization of multiple, partially conflicting objectives. True multi-objective optimization (MOO) methods avoid the need to choose a weighting of the objectives a priori and provide insights about the tradeoffs between the objectives. We extend a state-of-the-art derivative-free Monte Carlo method for MOO, the MO-CMA-ES, to operate on an unbounded set of (n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Results in Mathematics
سال: 2003
ISSN: 0378-6218,1420-9012
DOI: 10.1007/bf03322748